Cake-cutting algorithms - be fair if you can

Review: Cake-Cutting Algorithms: Be Fair if You Can

BetterWays to Cut a Cake

I n this paper we show how mathematics can illuminate the study of cake-cutting in ways that have practical implications. Specifically, we analyze cake-cutting algorithms that use a minimal number of cuts (n − 1 if there are n people), where a cake is a metaphor for a heterogeneous, divisible good, whose parts may be valued differently by different people. These algorithms not only establish th...

The Win - Win Solution

1. The following four books are all reviewed together by William Gasarch. Fair Division: From Cake Cutting to Dispute Resolution) , by Brams and Taylor, Cake Cutting: Be Fair if You Can by Robertson and Webb, The Win-Win Solution by Brams and Taylor, and Fair Allocation (Proceedings of Symposia in Applied Mathematics, Vol 33) Edited by H. Peyton Young. These books all deal with the problem of f...

H R  C C *

Fair cake-cutting is the division of a cake or resource among N users so that each user is content. Users may value a given piece of cake differently, and information about how a user values different parts of the cake can only be obtained by requesting users to “cut” pieces of the cake into specified ratios. Many distributed computing problems which involve resource sharing can be expressed as...

Cake-Cutting Is Not a Piece of Cake

Fair cake-cutting is the division of a cake or resource among N users so that each user is content. Users may value a given piece of cake differently, and information about how a user values different parts of the cake can only be obtained by requesting users to “cut” pieces of the cake into specified ratios. One of the most interesting open questions is to determine the minimum number of cuts ...